//2009/08/17 19:20:14
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <sstream>
#include <algorithm>

using namespace std;

class CompetitionStatistics
{
public:
    int consecutiveGrowth(vector <int> r)
    {
		int mmax = 0;
		int inc = 0;
		for(int i=0; i<r.size(); i++)
		{
			if(r[i] > 0 )
			{
				inc ++;
			}
			else 
			{
				mmax = max(mmax, inc);
				inc = 0;
			}
		}
		mmax = max(inc, mmax);
		return mmax;
    }
};
